منابع مشابه
Interval cyclic edge-colorings of graphs
A proper edge-coloring of a graph G with colors 1, , t is called an interval cyclic t coloring if all colors are used, and the edges incident to each vertex ( ) v V G are colored with ( ) G d v consecutive colors by modulo t , where ( ) G d v is the degree of the vertex v in G . In this paper some properties of interval cyclic edge-colorings are investigated. Also, we give some bounds for...
متن کاملInterval edge-colorings of composition of graphs
An edge-coloring of a graph G with consecutive integers c1, . . . , ct is called an interval t-coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. The set of all interval colorable graphs is denoted by N. In 2004, Giaro and...
متن کاملInterval edge-colorings of complete graphs
An edge-coloring of a graph G with colors 1, 2, . . . , t is an interval t-coloring if all colors are used, and the colors of edges incident to each vertex of G are distinct and form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. For an interval colorable graph G, W (G) denotes the greatest value of t for which G has an int...
متن کاملOn interval edge-colorings of outerplanar graphs
A proper edge-coloring of a graph G with colors 1, . . . , t is called an interval t-coloring if the colors of edges incident to any vertex of G form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. For an interval colorable graph G, the least value of t for which G has an interval t-coloring is denoted by w(G). A graph G is ...
متن کاملInterval edge-colorings of cubic graphs
An edge-coloring of a multigraph with colors 1, is called an interval coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. In this paper we prove that if is a connected cubic multigraph (a connected cubic graph) that admits an interval coloring, then G 2, , t ... t −
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.01.023